Finding structure in sequences of real numbers via graph theory: a problem list
نویسندگان
چکیده
We investigate a method of generating graph $G=(V,E)$ out an ordered list $n$ distinct real numbers $a_1, \dots, a_n$. These graphs can be used to test for the presence interesting structure in sequence. describe sequences exhibiting intricate hidden that was discovered this way. Our includes Deutsch, Erd\H{o}s, Freud & Hegyvari, Recaman, Quet, Zabolotskiy and Zizka. Since our observations are mostly empirical, each sequence is open problem.
منابع مشابه
Finding Folkman Numbers via MAX CUT Problem
In this note we report on our recent work, still in progress, regarding Folkman numbers. Let f(2, 3, 4) denote the smallest integer n such that there exists a K4– free graph of order n having that property that any 2–coloring of its edges yields at least one monochromatic triangle. It is well–known that such a number must exist [4,10]. For almost twenty years the best known upper bound, given b...
متن کاملFinding Reconfigurations between List Edge-Colorings of a Graph
Reconfiguration problems arise when we wish to find a step-by-step transformation between two feasible solutions of a problem such that all intermediate results are also feasible. Recently, Ito et al. [5] proposed a framework of reconfiguration problems, and gave complexity and approximability results for reconfiguration problems derived from several well-known problems, such as independent set...
متن کاملOn the diameter of the commuting graph of the full matrix ring over the real numbers
In a recent paper C. Miguel proved that the diameter of the commuting graph of the matrix ring $mathrm{M}_n(mathbb{R})$ is equal to $4$ if either $n=3$ or $ngeq5$. But the case $n=4$ remained open, since the diameter could be $4$ or $5$. In this work we close the problem showing that also in this case the diameter is $4$.
متن کاملFinding Cliques of a Graph using Prime Numbers
This paper proposes a new algorithm for solving maximal cliques for simple undirected graphs using the theory of prime numbers. A novel approach using prime numbers is used to find cliques and ends with a discussion of the algorithm.
متن کاملOn a problem in extremal graph theory
The number T*(n, k) is the least positive integer such that every graph with n = (*:I) + t vertices (t > 0) and at least T*(n, k) edges contains k mutually vertex-disjoint complete subgraphs S, , S, ,..., Sk where S, has ivertices, I < i Q k. Obviously T*(n, k) > T(n, k), the Turan number of edges for a Ki . It is shown that if n > gkk” then equality holds and that there is c :0 such that for (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Involve
سال: 2022
ISSN: ['1944-4184', '1944-4176']
DOI: https://doi.org/10.2140/involve.2022.15.251